0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.11/0.33	% Computer : n024.cluster.edu
0.11/0.33	% Model    : x86_64 x86_64
0.11/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory   : 8042.1875MB
0.11/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 1920
0.11/0.33	% WCLimit    : 240
0.11/0.33	% DateTime   : Wed Jul 30 03:03:19 EDT 2025
0.11/0.33	% CPUTime    : 
0.18/0.45	Running higher-order theorem proving
0.18/0.46	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.ytbllVE3eC/E---3.1_5026.p
40.41/5.58	# Version: 3.0.0-ho
40.41/5.58	# Preprocessing class: HSSSSMSSSSSNHHA.
40.41/5.58	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
40.41/5.58	# Starting sh2lt with 960s (4) cores
40.41/5.58	# Starting new_ho_10_unif with 240s (1) cores
40.41/5.58	# Starting full_lambda_6 with 240s (1) cores
40.41/5.58	# Starting post_as_ho1 with 240s (1) cores
40.41/5.58	# Starting ehoh_best3_rw with 240s (1) cores
40.41/5.58	# new_ho_10_unif with pid 5105 completed with status 0
40.41/5.58	# Result found by new_ho_10_unif
40.41/5.58	# Preprocessing class: HSSSSMSSSSSNHHA.
40.41/5.58	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
40.41/5.58	# Starting sh2lt with 960s (4) cores
40.41/5.58	# Starting new_ho_10_unif with 240s (1) cores
40.41/5.58	# No SInE strategy applied
40.41/5.58	# Search class: HGHNF-FFSF22-SHHFFSBN
40.41/5.58	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
40.41/5.58	# Starting new_ho_10_unif with 80s (1) cores
40.41/5.58	# new_ho_10_unif with pid 5112 completed with status 0
40.41/5.58	# Result found by new_ho_10_unif
40.41/5.58	# Preprocessing class: HSSSSMSSSSSNHHA.
40.41/5.58	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
40.41/5.58	# Starting sh2lt with 960s (4) cores
40.41/5.58	# Starting new_ho_10_unif with 240s (1) cores
40.41/5.58	# No SInE strategy applied
40.41/5.58	# Search class: HGHNF-FFSF22-SHHFFSBN
40.41/5.58	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
40.41/5.58	# Starting new_ho_10_unif with 80s (1) cores
40.41/5.58	# Preprocessing time       : 0.001 s
40.41/5.58	# Presaturation interreduction done
40.41/5.58	
40.41/5.58	# Proof found!
40.41/5.58	# SZS status Theorem
40.41/5.58	# SZS output start CNFRefutation
40.41/5.58	thf(decl_sort1, type, a: $tType).
40.41/5.58	thf(decl_23, type, cLQ: a > a > $o).
40.41/5.58	thf(decl_24, type, esk1_0: (a > $o) > a).
40.41/5.58	thf(decl_25, type, esk2_2: (a > $o) > a > a).
40.41/5.58	thf(decl_26, type, esk3_0: a > a).
40.41/5.58	thf(cTHM145L1_pme, conjecture, ![X1:(a > $o) > a]:(((![X2:a, X3:a, X4:a]:(((cLQ @ X2 @ X4)<=((cLQ @ X3 @ X4)&(cLQ @ X2 @ X3))))&![X5:a > $o]:((![X6:a]:((![X7:a]:(((X5 @ X7)=>(cLQ @ X7 @ X6)))=>(cLQ @ (X1 @ X5) @ X6)))&![X4:a]:(((X5 @ X4)=>(cLQ @ X4 @ (X1 @ X5)))))))=>![X8:a > a]:((![X2:a, X3:a]:(((cLQ @ (X8 @ X2) @ (X8 @ X3))<=(cLQ @ X2 @ X3)))=>?[X9:a]:(((cLQ @ (X8 @ X9) @ X9)&(cLQ @ X9 @ (X8 @ X9)))))))), file('/export/starexec/sandbox/tmp/tmp.ytbllVE3eC/E---3.1_5026.p', cTHM145L1_pme)).
40.41/5.58	thf(c_0_1, negated_conjecture, ~(![X1:(a > $o) > a]:(((![X2:a, X3:a, X4:a]:((((cLQ @ X3 @ X4)&(cLQ @ X2 @ X3))=>(cLQ @ X2 @ X4)))&![X5:a > $o]:((![X6:a]:((![X7:a]:(((X5 @ X7)=>(cLQ @ X7 @ X6)))=>(cLQ @ (X1 @ X5) @ X6)))&![X4:a]:(((X5 @ X4)=>(cLQ @ X4 @ (X1 @ X5)))))))=>![X8:a > a]:((![X2:a, X3:a]:(((cLQ @ X2 @ X3)=>(cLQ @ (X8 @ X2) @ (X8 @ X3))))=>?[X9:a]:(((cLQ @ (X8 @ X9) @ X9)&(cLQ @ X9 @ (X8 @ X9))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145L1_pme])])).
40.41/5.58	thf(c_0_2, negated_conjecture, ![X23:a, X24:a, X25:a, X26:a > $o, X27:a, X29:a, X31:a, X32:a, X33:a]:((((~(cLQ @ X24 @ X25)|~(cLQ @ X23 @ X24)|(cLQ @ X23 @ X25))&((((X26 @ (esk2_2 @ X26 @ X27))|(cLQ @ (esk1_0 @ X26) @ X27))&(~(cLQ @ (esk2_2 @ X26 @ X27) @ X27)|(cLQ @ (esk1_0 @ X26) @ X27)))&(~(X26 @ X29)|(cLQ @ X29 @ (esk1_0 @ X26)))))&((~(cLQ @ X31 @ X32)|(cLQ @ (esk3_0 @ X31) @ (esk3_0 @ X32)))&(~(cLQ @ (esk3_0 @ X33) @ X33)|~(cLQ @ X33 @ (esk3_0 @ X33)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
40.41/5.58	thf(c_0_3, negated_conjecture, ![X4:a, X3:a, X2:a]:(((cLQ @ X4 @ X3)|~((cLQ @ X2 @ X3))|~((cLQ @ X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
40.41/5.58	thf(c_0_4, negated_conjecture, ![X5:a > $o, X2:a]:(((X5 @ (esk2_2 @ X5 @ X2))|(cLQ @ (esk1_0 @ X5) @ X2))), inference(split_conjunct,[status(thm)],[c_0_2])).
40.41/5.58	thf(c_0_5, negated_conjecture, ![X2:a, X18:a > a, X8:a > a, X3:a]:(((cLQ @ (X8 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0)))) @ X2)) @ X3)|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0))))) @ X2)|~((cLQ @ (X18 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0)))) @ X2)) @ X3)))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
40.41/5.58	thf(c_0_6, negated_conjecture, ![X2:a, X3:a]:(((cLQ @ (esk3_0 @ X2) @ (esk3_0 @ X3))|~((cLQ @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
40.41/5.58	thf(c_0_7, negated_conjecture, ![X5:a > $o, X2:a]:(((cLQ @ X2 @ (esk1_0 @ X5))|~((X5 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
40.41/5.58	thf(c_0_8, negated_conjecture, ![X2:a, X18:a > a, X8:a > a, X3:a]:(((cLQ @ (X8 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0))))) @ X2)) @ (esk3_0 @ X3))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0)))))) @ X2)|~((cLQ @ (X18 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0))))) @ X2)) @ X3)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
40.41/5.58	thf(c_0_9, negated_conjecture, ![X40:a > a > $o, X2:a]:(((cLQ @ (esk2_2 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0))) @ X2) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0)))))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0)))) @ X2))), inference(spm,[status(thm)],[c_0_7, c_0_4])).
40.41/5.58	thf(c_0_10, negated_conjecture, ![X5:a > $o, X2:a]:(((cLQ @ (esk1_0 @ X5) @ X2)|~((cLQ @ (esk2_2 @ X5 @ X2) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
40.41/5.58	thf(c_0_11, negated_conjecture, ![X2:a]:(((cLQ @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))) @ X2) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))) @ X2))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
40.41/5.58	thf(c_0_12, negated_conjecture, ![X8:a > a, X2:a]:(((cLQ @ (esk3_0 @ X2) @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ (X8 @ Z0)))))))|~((cLQ @ X2 @ (X8 @ (esk3_0 @ X2)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])).
40.41/5.58	thf(c_0_13, negated_conjecture, (cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
40.41/5.58	thf(c_0_14, negated_conjecture, ![X2:a]:((~((cLQ @ (esk3_0 @ X2) @ X2))|~((cLQ @ X2 @ (esk3_0 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_2])).
40.41/5.58	thf(c_0_15, negated_conjecture, (cLQ @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
40.41/5.58	thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']).
40.41/5.58	# SZS output end CNFRefutation
40.41/5.58	# Parsed axioms                        : 3
40.41/5.58	# Removed by relevancy pruning/SinE    : 0
40.41/5.58	# Initial clauses                      : 8
40.41/5.58	# Removed in clause preprocessing      : 2
40.41/5.58	# Initial clauses in saturation        : 6
40.41/5.58	# Processed clauses                    : 878
40.41/5.58	# ...of these trivial                  : 170
40.41/5.58	# ...subsumed                          : 209
40.41/5.58	# ...remaining for further processing  : 499
40.41/5.58	# Other redundant clauses eliminated   : 0
40.41/5.58	# Clauses deleted for lack of memory   : 0
40.41/5.58	# Backward-subsumed                    : 41
40.41/5.58	# Backward-rewritten                   : 58
40.41/5.58	# Generated clauses                    : 50845
40.41/5.58	# ...of the previous two non-redundant : 46357
40.41/5.58	# ...aggressively subsumed             : 0
40.41/5.58	# Contextual simplify-reflections      : 1
40.41/5.58	# Paramodulations                      : 50682
40.41/5.58	# Factorizations                       : 162
40.41/5.58	# NegExts                              : 0
40.41/5.58	# Equation resolutions                 : 1
40.41/5.58	# Disequality decompositions           : 0
40.41/5.58	# Total rewrite steps                  : 4949
40.41/5.58	# ...of those cached                   : 4062
40.41/5.58	# Propositional unsat checks           : 0
40.41/5.58	#    Propositional check models        : 0
40.41/5.58	#    Propositional check unsatisfiable : 0
40.41/5.58	#    Propositional clauses             : 0
40.41/5.58	#    Propositional clauses after purity: 0
40.41/5.58	#    Propositional unsat core size     : 0
40.41/5.58	#    Propositional preprocessing time  : 0.000
40.41/5.58	#    Propositional encoding time       : 0.000
40.41/5.58	#    Propositional solver time         : 0.000
40.41/5.58	#    Success case prop preproc time    : 0.000
40.41/5.58	#    Success case prop encoding time   : 0.000
40.41/5.58	#    Success case prop solver time     : 0.000
40.41/5.58	# Current number of processed clauses  : 394
40.41/5.58	#    Positive orientable unit clauses  : 73
40.41/5.58	#    Positive unorientable unit clauses: 0
40.41/5.58	#    Negative unit clauses             : 14
40.41/5.58	#    Non-unit-clauses                  : 307
40.41/5.58	# Current number of unprocessed clauses: 45044
40.41/5.58	# ...number of literals in the above   : 140874
40.41/5.58	# Current number of archived formulas  : 0
40.41/5.58	# Current number of archived clauses   : 105
40.41/5.58	# Clause-clause subsumption calls (NU) : 12683
40.41/5.58	# Rec. Clause-clause subsumption calls : 10842
40.41/5.58	# Non-unit clause-clause subsumptions  : 239
40.41/5.58	# Unit Clause-clause subsumption calls : 2109
40.41/5.58	# Rewrite failures with RHS unbound    : 0
40.41/5.58	# BW rewrite match attempts            : 1969
40.41/5.58	# BW rewrite match successes           : 62
40.41/5.58	# Condensation attempts                : 878
40.41/5.58	# Condensation successes               : 4
40.41/5.58	# Termbank termtop insertions          : 11934576
40.41/5.58	# Search garbage collected termcells   : 336
40.41/5.58	
40.41/5.58	# -------------------------------------------------
40.41/5.58	# User time                : 4.836 s
40.41/5.58	# System time              : 0.178 s
40.41/5.58	# Total time               : 5.014 s
40.41/5.58	# Maximum resident set size: 1700 pages
40.41/5.58	
40.41/5.58	# -------------------------------------------------
40.41/5.58	# User time                : 4.837 s
40.41/5.58	# System time              : 0.179 s
40.41/5.58	# Total time               : 5.017 s
40.41/5.58	# Maximum resident set size: 1728 pages
40.41/5.58	% E exiting
40.41/5.58	% E exiting
40.41/5.58	EOF